AN O(n log n) ALGORITHM FOR A SINK LOCA- TION PROBLEM IN DYNAMIC TREE NETWORKS
نویسندگان
چکیده
In this paper, we consider a sink location in a dynamic network which consists of a graph with capacities and transit times on its arcs. Given a dynamic network with initial supplies at vertices, the problem is to find a vertex v as a sink in the network such that we can send all the initial supplies to v as quickly as possible. We present an O(n log n) time algorithm for the sink location problem in a dynamic network of tree structure, where n is the number of vertices in the network. This improves upon the existing O(n)-time bound. As a corollary, we also show that the quickest transshipment problem can be solved in O(n log n) time if a given network is a tree and has a single sink. Our results are based on data structures for representing tables (i.e., sets of intervals with their height), which may be of independent interest.
منابع مشابه
An O(n log 2n) Algorithm for the Optimal Sink Location Problem in Dynamic Tree Networks
In this paper, we consider a sink location in a dynamic network which consists of a graph with capacities and transit times on its arcs. Given a dynamic network with initial supplies at vertices, the problem is to find a vertex v as a sink in the network such that we can send all the initial supplies to v as quickly as possible. We present an O(n log n) time algorithm for the sink location prob...
متن کاملMinimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity
This paper addresses the minimax regret sink location problem in dynamic tree networks. In our model, a dynamic tree network consists of an undirected tree with positive edge lengths and uniform edge capacity, and the vertex supply which is a positive value is unknown but only the interval of supply is known. A particular realization of supply to each vertex is called a scenario. Under any scen...
متن کاملAlgorithms for E cient Filtering in Content Based Multicast
Content Based Multicast is a type of multicast where the source sends a set of di erent classes of information and not all the sub scribers in the multicast group need all the information Use of ltering publish subscribe agents on the intermediate nodes was suggested to lter out the unnecessary information on the multicast tree However lters have their own drawbacks like processing delays and i...
متن کاملAn efficient algorithm for finding the semi-obnoxious $(k,l)$-core of a tree
In this paper we study finding the $(k,l)$-core problem on a tree which the vertices have positive or negative weights. Let $T=(V,E)$ be a tree. The $(k,l)$-core of $T$ is a subtree with at most $k$ leaves and with a diameter of at most $l$ which the sum of the weighted distances from all vertices to this subtree is minimized. We show that, when the sum of the weights of vertices is negative, t...
متن کاملMinmax Tree Facility Location and Sink Evacuation with Dynamic Confluent Flows
Let G = (V,E) be a graph modelling a building or road network in which edges have-both travel times (lengths) and capacities associated with them. An edge’s capacity is the number of people that can enter that edge in a unit of time. In emergencies, people evacuate towards the exits. If too many people try to evacuate through the same edge, congestion builds up and slows down the evacuation. Gr...
متن کامل